- arithmetical form
- мат.арифметическая форма
English-Russian scientific dictionary. 2008.
arithmetical form
Смотреть что такое "arithmetical form" в других словарях:
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
arithmetical mean — Mean Mean, n. 1. That which is mean, or intermediate, between two extremes of place, time, or number; the middle point or place; middle rate or degree; mediocrity; medium; absence of extremes or excess; moderation; measure. [1913 Webster] But to… … The Collaborative International Dictionary of English
arithmetical hierarchy — noun A classification of sets of natural numbers by the complexity of the formulas in the language of Peano arithmetic that define them, specifically by the number of alternations of A and E in the defining formula given the formula is in prenex… … Wiktionary
Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… … Wikipedia
Prenex normal form — A formula of the predicate calculus is in prenex[1] normal form if it is written as a string of quantifiers followed by a quantifier free part (referred to as the matrix). Every formula in classical logic is equivalent to a formula in prenex… … Wikipedia
Binary quadratic form — In mathematics, a binary quadratic form is a quadratic form in two variables. More concretely, it is a homogeneous polynomial of degree 2 in two variables where a, b, c are the coefficients. Properties of binary quadratic forms depend in an… … Wikipedia
Extended Backus–Naur Form — In computer science, Extended Backus–Naur Form (EBNF) is a metasyntax notation used to express context free grammars: that is, a formal way to describe computer programming languages and other formal languages. It is an extension of the basic… … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
golden rule — noun a) A fundamental rule or principle. It is all important to remember that naturalists have no golden rule by which to distinguish species and varieties. b) The principle that one should treat other people in the manner in which one would want … Wiktionary
George Peacock — Infobox Scientist name = George Peacock box width = 300px image width = 170px caption = birth date = April 9, 1791 birth place = Denton, Yorkshire, England death date = November 8, 1858 death place = Pall Mall, London, England residence = England … Wikipedia
Exact sciences (The) in Hellenistic times: texts and issues — The exact sciences in Hellenistic times: Texts and issues1 Alan C.Bowen Modern scholars often rely on the history of Greco Latin science2 as a backdrop and support for interpreting past philosophical thought. Their warrant is the practice… … History of philosophy
